CSE 311: Section 0

Task 1 – Warm Up

Translate these English statements into propositional logic, making the atomic propositions as simple as possible and exposing as much of the logic via symbols as possible.

  1. “If I am lifting weights this afternoon, then I do a warm-up exercise.”

  2. “I can go home only if I have finished my homework.”

Task 2 – More Translations

Translate these English statements into propositional logic, making the atomic propositions as simple as possible and exposing as much of the logic via symbols as possible.

  1. “If a red apple falls on my head and I come up with the concept of gravity, then I am Isaac Newton.”

  2. “If I find an apple on my doorstep, then I will be very happy, but I will not dance. But if I find an orange on my doorstep, then I will be very happy and I will dance.”

  3. “If it is the case that whenever I find lemons, I make lemonade, then it is also the case that whenever I find green apples, I make apple juice.”

Task 3 – English Translations

Translate these propositional logic statements back into English. The atomic propositional logic variables are defined as follows:
aa: The cat sees the mouse.
bb: The mouse sees the cat.
cc: The cat catches the mouse.
dd: The mouse is scared.
ee: The cat chases the mouse.
ff: The mouse stands still.

  1. (a¬b)(¬dc)(a \land \lnot b) \rightarrow (\lnot d \land c)

  2. (ab)(((f(dc))(¬f(e¬c)))(a \land b) \rightarrow (((f \rightarrow (d \land c)) \land (\lnot f \rightarrow (e \land \lnot c)))

Task 4 – The Calm Before the Form

Consider the boolean functions F(A,B,C)F(A, B, C) and G(A,B,C)G(A, B, C) specified by the following truth table:

AA BB CC F(A,B,C)F(A, B, C) G(A,B,C)G(A, B, C)
T T T T F
T T F T T
T F T F F
T F F F F
F T T T T
F T F T F
F F T F T
F F F T F
  1. Write the DNF and CNF expressions for F(A,B,C)F(A, B, C).

  2. Write the DNF and CNF expressions for G(A,B,C)G(A, B, C).

Task 5 – Circuits

Translate the following circuit into a logical expression.

A circuit that reads, from top to bottom and left to right: p to not gate to or gate. p to and gate to the same or gate as before. q to not gate to the and gate of the first p. The or gate connects to a not gate. In logic, this reads as not (not p or (p and not q))